Sparse broadband beamformer design via proximal optimization Techniques
نویسندگان
چکیده
منابع مشابه
Near-field broadband beamformer design via multidimensional semi-infinite-linear programming techniques
Broadband microphone arrays has important applications such as hands-free mobile telephony, voice interface to personal computers and video conference equipment. This problem can be tackled in different ways. In this paper, a general broadband beamformer design problem is considered. The problem is posed as a Chebyshev minimax problem. Using the 1-norm measure or the real rotation theorem, we s...
متن کاملRobust beamformer weight design for broadband matched-field processsing
Matchedeld beamforming has been proposed for localizing wideband acoustic sources in uncertain underwater channels. While adaptive matchedeld beamforming provides adequate sidelobe suppression for stronger sources, at low signal-to-noise ratios it converges to its quiescent response, in this case the Bartlett beamformer, which has unacceptably high sidelobe levels. In this paper, a design metho...
متن کاملBroadband MVDR Beamformer Applying PSO
In this paper, a broadband MVDR(minimum variance distortionless response) beamforming method based on time-domain (TMVDR) is presented. Using TMVDR beamformer, stable sample matrix estimation could be obtained in short time period. To obtain the stable optimum solution of TMVDR, a numerical searching method optimized by PSO algorithm with constrain condition is introduced. Out-sea experiment sh...
متن کاملProximal gradient algorithm for group sparse optimization
In this paper, we propose a proximal gradient algorithm for solving a general nonconvex and nonsmooth optimization model of minimizing the summation of a C1,1 function and a grouped separable lsc function. This model includes the group sparse optimization via lp,q regularization as a special case. Our algorithmic scheme presents a unified framework for several well-known iterative thresholding ...
متن کاملSparse phase retrieval via group-sparse optimization
This paper deals with sparse phase retrieval, i.e., the problem of estimating a vector from quadratic measurements under the assumption that few components are nonzero. In particular, we consider the problem of finding the sparsest vector consistent with the measurements and reformulate it as a group-sparse optimization problem with linear constraints. Then, we analyze the convex relaxation of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of nonlinear and variational analysis
سال: 2023
ISSN: ['2560-6778', '2560-6921']
DOI: https://doi.org/10.23952/jnva.7.2023.4.02